An example of elliptic curve over Q with rank equal to 15

نویسنده

  • Andrej Dujella
چکیده

We construct an elliptic curve over Q with non-trivial 2-torsion point and rank exactly equal to 15.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Silverman's conjecture for a family of elliptic curves

Let $E$ be an elliptic curve over $Bbb{Q}$ with the given Weierstrass equation $ y^2=x^3+ax+b$. If $D$ is a squarefree integer, then let $E^{(D)}$ denote the $D$-quadratic twist of $E$ that is given by $E^{(D)}: y^2=x^3+aD^2x+bD^3$. Let $E^{(D)}(Bbb{Q})$ be the group of $Bbb{Q}$-rational points of $E^{(D)}$. It is conjectured by J. Silverman that there are infinitely many primes $p$ for which $...

متن کامل

Three lectures on elliptic surfaces and curves of high rank

Three lectures on elliptic surfaces and curves of high rank Noam D. Elkies Over the past two years we have improved several of the (Mordell–Weil) rank records for elliptic curves over Q and nonconstant elliptic curves over Q(t). For example, we found the first example of a curve E/Q with 28 independent points P i ∈ E(Q) (the previous record was 24, by R. Martin and W. McMillen 2000), and the fi...

متن کامل

On the rank of elliptic curves over Q(i) with torsion group Z/4Z× Z/4Z

We construct an elliptic curve over Q(i) with torsion group Z/4Z× Z/4Z and rank equal to 7 and a family of elliptic curves with the same torsion group and rank ≥ 2.

متن کامل

On the Elliptic Curves of the Form $y^2 = x^3 − pqx$

‎By the Mordell‎- ‎Weil theorem‎, ‎the group of rational points on an elliptic curve over a number field is a finitely generated abelian group‎. ‎This paper studies the rank of the family Epq:y2=x3-pqx of elliptic curves‎, ‎where p and q are distinct primes‎. ‎We give infinite families of elliptic curves of the form y2=x3-pqx with rank two‎, ‎three and four‎, ‎assuming a conjecture of Schinzel ...

متن کامل

Efficient elliptic curve cryptosystems

Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002